Verified program code execution system prototype
نویسندگان
چکیده
منابع مشابه
Source Code Documentation Generation Using Program Execution
Automated source code documentation approaches often describe methods in abstract terms, using the words contained in the static source code or code excerpts from repositories. In this paper, we describe DynamiDoc: a simple automated documentation generator based on dynamic analysis. Our representation-based approach traces the program being executed and records string representations of concre...
متن کاملVerified proof carrying code
Proof Carrying Code (PCC) is a technique to exclude safety errors in low level code. Instead of runtime tests, it statically checks a proof of safety (a certificate) attached to the code. To guarantee that PCC only accepts safe code, we formalise and verify it in Isabelle/HOL, an interactive theorem prover for higher order logic. In an abstract framework we identify key components and their int...
متن کاملCode Clone Detection Technique Using Program Execution Traces
Code clone is a code fragment that has identical or similar fragments to it in the source code. Many code clone detection techniques and tools have been proposed. However, source code derived by copy-and-paste may be disguised by obfuscation because these techniques detect code clone using only static information such as source code or binary. Therefore, we propose a new clone detection techniq...
متن کاملA Student Program Recommendation System Prototype
Recommendation systems have emerged as a useful e-commerce tool to assist customers in making purchases based on similarities and preferences of others. However, their potential has not been highly utilized to help in one area that could assist both professors and students student advising. Using a recommender system has potential risks such as lower student retention if the system makes poor r...
متن کاملA Machine-Verified Code Generator
We consider the machine-supported verification of a code generator computing machine code from WHILE-programs, i.e. abstract syntax trees which may be obtained by a parser from programs of an imperative programming language. We motivate the representation of states developed for the verification, which is crucial for success, as the interpretation of tree-structured WHILE-programs differs signi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2017
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2017-29(6)-1